Approximation Properties of Positive Boolean Functions
نویسنده
چکیده
The universal approximation property is an important characteristic of models employed in the solution of machine learning problems. The possibility of approximating within a desired precision any Borel measurable function guarantees the generality of the considered approach. The properties of the class of positive Boolean functions, realizable by digital circuits containing only and and or ports, is examined by considering a proper coding for ordered and nominal variables, which is able to preserve ordering and distance. In particular, it is shown that positive Boolean functions are universal approximators and can therefore be used in the solution of classification and regression problems.
منابع مشابه
SUPER- AND SUB-ADDITIVE ENVELOPES OF AGGREGATION FUNCTIONS: INTERPLAY BETWEEN LOCAL AND GLOBAL PROPERTIES, AND APPROXIMATION
Super- and sub-additive transformations of aggregation functions have been recently introduced by Greco, Mesiar, Rindone and v{S}ipeky [The superadditive and the subadditive transformations of integrals and aggregation functions, {it Fuzzy Sets and Systems} {bf 291} (2016), 40--53]. In this article we give a survey of the recent development regarding the existence of aggregation functions with ...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملAn Algorithm for Affine Approximation of Binary Decision Diagrams
This paper is concerned with the problem of Boolean approximation in the following sense: given a Boolean function class and an arbitrary Boolean function, what is the function’s best proxy in the class? Specifically, what is its strongest logical consequence (or envelope) in the class of affine Boolean functions. We prove various properties of affine Boolean functions and their representation ...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملInfluence and interaction indexes for pseudo-Boolean functions: a unified least squares approach
The Banzhaf power and interaction indexes for a pseudo-Boolean function (or a cooperative game) appear naturally as leading coefficients in the standard least squares approximation of the function by a pseudo-Boolean function of a specified degree. We first observe that this property still holds if we consider approximations by pseudo-Boolean functions depending only on specified variables. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005